An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
نویسندگان
چکیده
منابع مشابه
An Approximation Algorithm for the Maximum Traveling Salesman Problem
We develop a polynomial time approximation algorithm for the maximum traveling salesman problem. It guarantees a solution value of at least r times the optimal one for any given r < 5 7 .
متن کاملApproximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufficient capacity on e...
متن کاملAn Approximation Algorithm for the Maximum Cut Problem 138
An approximation algorithm for Max Cut is designed and analyzed; its performances are experimentally compared with those of a neural algorithm and of the Goemans and Williamson's algorithm.
متن کاملOn Approximating the Maximum Simple Sharing Problem
In the maximum simple sharing problem (MSS), we want to compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the graph, with the constraint that all paths have both endpoints in the other layer. This is a variation of the maximum sharing problem (MS) that finds important applications in the design of molecular quantum-do...
متن کاملAn Efficient Algorithm for the Knapsack Sharing Problem
The Knapsack Sharing Problem (KSP) is an NP-Hard combinatorial optimization problem, admitted in numerous real world applications. In the KSP, we have a knapsack of capacity c and a set of n objects, namely N , where each object j, j = 1, . . . , n, is associated with a profit p j and a weight w j . The set of objects N is composed of m different classes of objects Ji , i = 1, . . . , m, and N ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2008
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2008.00492